a scheduling model for the re-entrant manufacturing system and its optimization by nsga-ii

Authors

masoud rabbani

college of engineering, university of tehran, tehran, iran safoura famil alamdar

university of tehran, tehran, iran parisa famil alamdar

amir kabir university, tehran, iran

abstract

in this study, a two-objective mixed-integer linear programming model (milp) for multi-product re-entrant flow shop scheduling problem has been designed. as a result, two objectives are considered. one of them is maximization of the production rate and the other is the minimization of processing time. the system has m stations and can process several products in a moment. the re-entrant flow shop scheduling problem is well known as np-hard problem and its complexity has been discussed by several researchers. given that nsga-ii algorithm is one of the strongest and most applicable algorithm in solving multi-objective optimization problems, it is used to solve this problem. to increase algorithm performance, taguchi technique is used to design experiments for algorithm’s parameters. numerical experiments are proposed to show the efficiency and effectiveness of the model. finally, the results of nsga-ii are compared with spea2 algorithm (strength pareto evolutionary algorithm 2). the experimental results show that the proposed algorithm performs significantly better than the spea2.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A Scheduling Model for the Re-entrant Manufacturing System and Its Optimization by NSGA-II

In this study, a two-objective mixed-integer linear programming model (MILP) for multi-product re-entrant flow shop scheduling problem has been designed. As a result, two objectives are considered. One of them is maximization of the production rate and the other is the minimization of processing time. The system has m stations and can process several products in a moment. The re-entrant flow sho...

full text

Scheduling Manufacturing Systems of Re{entrant Lines

Re{entrant lines are manufacturing systems where parts may return more than once to the same machine, for repeated stages of processing. Examples of such systems are semiconductor manufacturing plants. We consider the problems of scheduling such systems to reduce manufacturing lead times, variations in the manufacturing lead times, or holding costs. We assume a deterministic model, which allows...

full text

A knowledge-based NSGA-II approach for scheduling in virtual manufacturing cells

This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...

full text

Re-entrant Manufacturing Systems

Re-entrant manufacturing systems differ from traditional manufacturing systems in the sense that a job may visit a service station more than once, at various stages of the product development cycle. Several parts at different stages of processing may be in contention for service at the same machine, which gives rise to the need to solve scheduling problems. This document surveys some of the fac...

full text

Performance analysis of scheduling policies in re-entrant manufacturing systems

-Re-entrant lines are a class of non-traditional queueing network models that are congenial for the modeling of manufacturing systems with distinct multiple visits to work centers. Analyzing the performance of scheduling policies in re-entrant lines is a problem of significant research interest. Reentrant lines are non-product form owing to priority scheduling, and all the existing performance ...

full text

Developing a bi-objective optimization model for solving the availability allocation problem in repairable series–parallel systems by NSGA II

Bi-objective optimization of the availability allocation problem in a series–parallel system with repairable components is aimed in this paper. The two objectives of the problem are the availability of the system and the total cost of the system. Regarding the previous studies in series–parallel systems, the main contribution of this study is to expand the redundancy allocation problems to syst...

full text

My Resources

Save resource for easier access later


Journal title:
international journal of supply and operations management

جلد ۳، شماره ۳، صفحات ۱۴۱۳-۱۴۲۸

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023